How Hard Is Hard?

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

How hard is a colloidal "hard-sphere" interaction?

Poly-12-hydroxystearic acid (PHSA) is widely used as a coating on colloidal spheres to provide a "hard-sphere-type" interaction. These hard spheres have been widely used in fundamental studies of nucleation, crystallization, and glass formation. Most authors describe the interaction as "nearly" hard sphere. In this paper we directly measure this interaction, using layers of PHSA adsorbed onto m...

متن کامل

How hard are hard triggers?

We study Abusch’s (2002; 2010) distinction between hard and soft triggers from an experimental point of view. We show that there are apparent counterexamples to the distinction, discuss their status and describe future experiments aiming at clarifying the processing issues that form the core of the problem.

متن کامل

How Hard Is Hard Science, How Soft Is Soft Science? The Empirical Cumulativeness of Research

" Research results in the social and behavioral sciences are often conceded to be less replicable than research results in the physical sciences. However, direct empirical comparisons of the cumulativeness of research in the social and physical sciences have not been made to date. This article notes the parallels between methods used in the quantitative synthesis of research in the social and i...

متن کامل

How Hard is Compiler Code Generation?

Over the past two decades great strides have been made in understanding how to design lexical and syntactic analyzers for programming-language compilers. Theory and practice have proceeded to the point where usable lexical and syntactic analyzers can be generated automatically from notations based on regular expressions and context-free grammars [Aho and Ullman (1977), Johnson (1975), Lesk (197...

متن کامل

How Hard is Inference for Structured Prediction?

Structured prediction tasks in machine learning involve the simultaneous prediction of multiple labels. This is often done by maximizing a score function on the space of labels, which decomposes as a sum of pairwise elements, each depending on two specific labels. The goal of this paper is to develop a theoretical explanation of the empirical effectiveness of heuristic inference algorithms for ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Science

سال: 2010

ISSN: 0036-8075,1095-9203

DOI: 10.1126/science.327.5970.1181-a